منابع مشابه
An Optimal Predicate Locking Scheduler
The paper presents a predicate locking scheduler that maximizes concurrency by locking as many of the database entities as possible without compromising the correctness of execution of the database transactions. The scheduling strategy that guarantees the maximal concurrency is first identified, then a predicate language allowing an efficient implementation of this strategy is given. The optima...
متن کاملAn Optimal Maintenance Scheduler
A simplified sub-optimal service scheduling technique is presented that estimates the time between service tasks necessary to minimize the lifetime operating costs of HVAC&R equipment. The technique is simpler to implement in the field than the optimal solution, but still provides near optimal performance. The technique is described and its performance is compared to three benchmarks for determ...
متن کاملAn Optimal Instruction Scheduler for Superscalar Processor
Performance in superscalar processing strongly depends on the compiler’s ability to generate codes that can be executed by hardware in an optimal or near optimal order. Generating optimal code is an NP-complete problem. However, there is a need for highly optimized code, such as in superscalar or real-time systems. In this paper, an instruction scheduling scheme for optimizing a program trace i...
متن کاملAn Optimal Semi-Partitioned Scheduler Assuming Arbitrary Affinity Masks∗
Modern operating systems like Linux allow task migrations to be restricted by specifying pertask processor affinity masks. Such a mask specifies the set of processor cores upon which a task can be scheduled. In this paper, a semi-partitioned scheduler, AM-Red (affinity mask reduction), is presented for scheduling implicit-deadline sporadic tasks with arbitrary affinity masks on an identical mul...
متن کاملPredicate Detection for Parallel Computations with Locking Constraints
The happened-before model (or the poset model) has been widely used for modeling the computations (execution traces) of parallel programs and detecting predicates (user-specified conditions). This model captures potential causality as well as locking constraints among the executed events of computations using Lamport’s happened-before relation. The detection of a predicate in a computation is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0080